A feasible quantum communication complexity protocol

نویسنده

  • Ernesto F. Galvão
چکیده

I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency η. The task is a communication complexity problem in which distant parties need to compute a function of the distributed inputs, while minimizing the amount of communication between them. A quantum optical setup is suggested that can demonstrate a 5-party quantum protocol with higher-than-classical performance whenever η > 0.25 . In theory, quantum communication is better than classical communication. Experimentalists, on the other hand, know that even the simplest quantum communication protocols involve inefficiencies in state preparation, manipulation and measurement. It is, therefore, important to study sufficient experimental conditions for unambiguous demonstration of the advantages of quantum communication. Some tasks are only possible with quantum communication, such as unconditionally secure cryptographic key distribution [1, 2, 3]. Many authors have analyzed the experimental requirements for the security of these protocols [4, 5, 6]. For other tasks quantum communication offers an improvement of efficiency, and such is the case of.communication complexity problems [7, 8], one of which will be analyzed in this letter. In these problems many distant parties need to compute a function of the distributed inputs, while trying to minimize the amount of communication between them. This abstract problem has numerous practical applications, for example in computer networks, VLSI circuits and data structures (see [8] for a survey of the field). Quantum mechanics can enhance the performance of communication complexity protocols in two different ways [9]. The first approach is the entanglementbased model of communication complexity [10, 11, 12, 13], where in addition to the classical communication we allow the parties to do measurements on previously shared multi-party entangled states. Experimental requirements for some protocols of this kind have been studied in [14, 15], and it turns out that the high detection efficiency needed could be achieved in ion trap experiments [16].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Party Quantum Dialogue with the Capability to Expand the Number of Users at Runtime

Quantum dialogue is a type of quantum communication in which users can simultaneously send messages to each other. The earliest instances of quantum dialogue protocols faced security problems such as information leakage and were vulnerable to intercept and resend attacks. Therefore, several protocols have been presented that try to solve these defects. Despite these improvements, the quantum di...

متن کامل

Direct Sum Theorem for Bounded Round Quantum Communication Complexity

We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact that information is a lower bound on communication, and the fact that a direct sum property holds for quantum information complexity. We then give a protocol fo...

متن کامل

A Lower Bound on Entanglement-Assisted Quantum Communication Complexity

We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...

متن کامل

The Corruption Bound, Log Rank, and Communication Complexity

We prove that for every sign matrix A there is a deterministic communication protocol that uses O(corr1/4(A) log 2 rank(A)) bits of communication, where corr1/4(A) is the corruption/rectangle bound with error 1/4. This bound generalizes several of the known upper bounds on deterministic communication complexity, involving nondeterministic complexity, randomized complexity, information complexit...

متن کامل

Quantum One-Way Communication is Exponentially Stronger Than Classical Communication

In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, bounded-error) protocol requires poly(n) bits of communication. That quantum protocol requires two rounds of communication. Ever since Raz’s paper it was open whether the same exponential separation can be achieved with a quantum pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008